A semidefinite programming hierarchy for packing problems in discrete geometry David de Laat (TU Delft) Joint work with Frank Vallentin (Universit¨at zu K¨oln) Applications of Real Algebraic Geometry

Source URL: www.daviddelaat.nl

• NP-complete problems
• Operations research
• Independent set
• Optimization problem
• Discrete geometry
• Graph
• Duality
• Packing problems
• Mathematical optimization
• Planar graphs
• Matching
• Matroid

Summarizing and Understanding Large Graphs Danai Koutra1∗ , U Kang2 , Jilles Vreeken3 and Christos Faloutsos1 1 School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA 2

Source URL: eda.mmci.uni-saarland.de

• Graph theory
• Clique
• Bipartite graph
• Graph
• Degree
• Line graph
• Maximal independent set

What Others Are Saying About The FCC’s Set-Top Box Mandate Bipartisan Members of Congress 30 Members of the Congressional Black Caucus led by Rep. Yvette Clarke: “All Vid will cause irreparable harm to independent an

Source URL: futureoftv.com

• Federal Communications Commission
• Censorship of broadcasting in the United States
• Media regulation
• AllVid
• Multichannel video programming distributor
• Broadcast law
• Minority ownership of media outlets in the United States
• Net neutrality in the United States

Inequality and network structure

Source URL: wkets.org

• NP-complete problems
• Clique
• Independent set
• Graph
• Network theory
• Extremal graph theory
• Matching

The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK

Source URL: community.dur.ac.uk

• NP-complete problems
• Graph coloring
• Bipartite graph
• Parity
• Comparability graph
• Matching
• Trapezoid graph
• Interval graph
• Graph
• Independent set
• Interval edge coloring
• Planar graph

Spreading Processes and Large Components in Ordered, Directed Random Graphs Paul Horn∗ Malik Magdon-Ismail

Source URL: web.cs.du.edu

• SL
• Logarithm
• Jnos Komls
• Maximal independent set

JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015 Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek

Source URL: jmlr.org

• Graph theory
• Computational complexity theory
• Mathematics
• NP-complete problems
• Dense subgraph
• Independent set
• Planted clique
• Clique
• Dense graph
• Hypergraph
• Graph coloring
• Subgraph isomorphism problem

A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory Adam Yedidia Scott Aaronson

Source URL: www.scottaaronson.com

• Mathematics
• Theoretical computer science
• Computability theory
• Mathematical logic
• Theory of computation
• Turing machine
• Models of computation
• Busy beaver
• Halting problem
• ZermeloFraenkel set theory
• Computability
• Computable function

Parametric vs Nonparametric Models • Parametric models assume some finite set of parameters ✓. Given the parameters, future predictions, x, are independent of the observed data, D: P (x|✓, D) = P (x|✓) therefore

Source URL: mlss.tuebingen.mpg.de

Bowls Hampshire BD Officer ~ To Date  HBDA: Set up the Hampshire Bowls Development Alliance in 2011, with an approved constitution, as a BDA INTERVENTION AREA that had independent administration of funds (£5K) provid

Source URL: www.bowlshampshire.com

• Ball games
• Bowls